Arrow's Theorem for incomplete relations
نویسندگان
چکیده
منابع مشابه
Arrow's Theorem for incomplete relations
Let U be a set with three or more elements, let W be the set of weak orderings of U, let T be the set of total orderings of U, and let f be an n-ary function mapping Wn to W. Arrow’s Impossibility Theorem asserts that if f satisfies Arrow’s Condition P (“Pareto”) and Condition 3 (“independence of irrelevant alternatives”) then f is a projection function on total orderings, i. e., there is some ...
متن کاملDice games and Arrows theorem
We observe that non-transitivity is not the most general way that Arrows impossibility theorem is reected in dice games. Non-transitivity in dice games is a well-known phenomenon. It was described in several Scienti c American columns in the 1970s, beginning with [3], and has since become a popular topic, discussed in articles like [4, 5] and textbooks on elementary mathematics and probabilit...
متن کاملINCOMPLETE INTERVAL-VALUED HESITANT FUZZY PREFERENCE RELATIONS IN DECISION MAKING
In this article, we propose a method to deal with incomplete interval-valuedhesitant fuzzy preference relations. For this purpose, an additivetransitivity inspired technique for interval-valued hesitant fuzzypreference relations is formulated which assists in estimating missingpreferences. First of all, we introduce a condition for decision makersproviding incomplete information. Decision maker...
متن کاملA Representation Theorem for Spatial Relations
Spatial relations have been investigated in various inter-related areas such as qualitative spatial reasoning (for agents moving in an environment), geographic information science, general topology, and others. Most of the results are specific constructions of spatial relations that fulfill some required properties. Results on setting up axioms that capture the desired properties of the relatio...
متن کاملCategorical semantics for arrows
Arrows are an extension of the well-established notion of a monad in functional programming languages. This article presents several examples and constructions, and develops denotational semantics of arrows as monoids in categories of bifunctors C×C→ C. Observing similarities to monads – which are monoids in categories of endofunctors C→ C – it then considers Eilenberg-Moore and Kleisli constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2014
ISSN: 2352-2208
DOI: 10.1016/j.jlap.2014.02.012